Matching of XML Schemas and Relational Schemas
نویسندگان
چکیده
XML is widely used for data exchange between relational databases. Generic exchange tools are based on mappings between the elements of both schemas. Despite the benefits of using generic tools, the manual definition of the mappings can become a time consuming and error-prone task. Given this scenario we propose algorithms for the automatic matching of XML schemas(DTDs) and relational schemas. Considering we restricted the schemas formats allowed for DTDs and relational schemas, the algorithms(matchers) we proposed take advantage of the particularities of each schema to provide a more precise matching than the other solutions available. We also assess the effectiveness of our matchers running experiments using real world schemas on the movies domain.
منابع مشابه
Database Conceptual Schema Matching
Schema matching is a critical step in integration of heterogeneous data sources. properties and/or include other concepts and having Database. a novel, semi-automated and generic schema matching process. Prison Break solves the established practice (5), widely used for database migration and ontology where similar domain concepts may not be be identifiable via linguistic. Database / Oracle Data...
متن کاملMapping DTDs to relational schemas with semantic constraints
XML is becoming a prevalent format and standard for data exchange in many applications. With the increase of XML data, there is an urgent need to research some efficient methods to store and manage XML data. As relational databases are the primary choices for this purpose considering their data management power, it is necessary to research the problem of mapping XML schemas to relational schema...
متن کاملA Cost-Based Approach for Converting Relational Schemas to XML
Converting relational database schemas to XML schemas is important as applications originally written to manipulate relational data are converted to XML-enabled applications. Most research has focused on the challenging problem of efficiently extracting relational data through XML views. However, another important challenge is determining good XML schemas from existing relational schemas, so th...
متن کاملMatching XML DTDs to relational database views
In this paper we approach the problem of matching a set of XML Document Type Definitions against a view schema drawn form a relational database, aiming at evaluating the similarity between the view schema and the DTDs for (semi)automatic translation of relational tables (i.e., views, queries) data into XML documents. The paper discusses a matching algorithm and evaluates the similarity criteria...
متن کاملInference Document Type (Dtd) From Xml Document: Web Structure Mining
XML is becoming a prevalent format and defacto standard for data exchange in many applications. While traditionally, lots of data are stored and managed in relational databases. There is an urgent need to research some efficient methods to convert these data stored in relational databases to XML format when integrating and exchanging these data in XML format. The semantics of XML schemas are cr...
متن کامل